The language equivalence problem for HD0L systems having D0L growths

Exploring the inference problem for D0L-Systems

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Decidability of the HD0L ultimate periodicity problem

In this paper we prove the decidability of the HD0L ultimate periodicity problem.

On the Equivalence Problem for Attribute Systems

The authors have shown in Courcelle et al. (1982) that certain attribute systems called strongly noneireular can be translated into recursive program schemes taking derivation trees as arguments and called primitive reeursive schemes with parameters. In particular, the equivalence problem for strongly noncircular attribute systems reduces to the equivalence problem for the latter class of progr...

Watson-Crick D0L Systems

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...